Resource Graphs and Countermodels in Resource Logics

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resource Graphs and Countermodels in Resource Logics

In this abstract we emphasize the role of a semantic structure called resource graph in order to study the provability in some resource-sensitive logics, like the Bunched Implications Logic (BI) or the Non-commutative Logic (NL). Such a semantic structure is appropriate for capturing the particular interactions between different kinds of connectives (additives and multiplicatives in BI, commuta...

متن کامل

Proofs and Countermodels in Non-Classical Logics

Proofs and countermodels are the two sides of completeness proofs, but, in general, failure to find one does not automatically give the other. The limitation is encountered also for decidable non-classical logics in traditional completeness proofs based on Henkin’s method of maximal consistent sets of formulas. A method is presented that makes it possible to establish completeness in a direct w...

متن کامل

Resource Logics and Minimalist Grammars

This ESSLLI workshop is devoted to connecting the linguistic use of resource logics and categorial grammar to minimalist grammars and related generative grammars. Minimalist grammars are relatively recent, and although they stem from a long tradition of work in transformational grammar, they are largely informal apart from a few research papers. The study of resource logic, on the other hand, i...

متن کامل

Resource Logics, Grammars, and Processing

The paper discusses work in progress on developing a tabular deduction method for multimodal logical grammar. The method is based on a compilation procedure, a single elimination rule for multiplicative and additive (t) binary operators, and two rules defining residuation for the unary modals i/ #i . The method aims to achieve for multimodal logical grammar what chart-based parsing does for CFG...

متن کامل

Logics for resource-bounded agents

In this thesis, I criticise traditional epistemic logics based on possible worlds semantics, inspired by Hintikka, as a framework for representing the beliefs and knowledge of agents. The traditional approach suffers from the logical omniscience problem: agents are modelled as knowing all consequences of their knowledge, which is not an admissible assumption when modelling real-world reasoning ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2005

ISSN: 1571-0661

DOI: 10.1016/j.entcs.2004.06.069